Erlang (unit)

 ( Network Performance ) 

The erlang (symbol E) is a dimensionless unit that is used in telephony as a measure of offered load or carried load on service-providing elements such as telephone circuits or telephone switching equipment. A single cord circuit has the capacity to be used for 60 minutes in one hour. Full utilization of that capacity, 60 minutes of traffic, constitutes 1 erlang.

Carried traffic in erlangs is the average number of concurrent calls measured over a given period (often one hour), while offered traffic is the traffic that would be carried if all call-attempts succeeded. How much offered traffic is carried in practice will depend on what happens to unanswered calls when all servers are busy.

The CCITT named the international unit of telephone traffic the erlang in 1946 in honor of Agner Krarup Erlang. In Erlang's analysis of efficient telephone line usage, he derived the formulae for two important cases, Erlang-B and Erlang-C, which became foundational results in teletraffic engineering and queueing theory. His results, which are still used today, relate quality of service to the number of available servers. Both formulae take offered load as one of their main inputs (in erlangs), which is often expressed as call arrival rate times average call length.

A distinguishing assumption behind the Erlang B formula is that there is no queue, so that if all service elements are already in use then a newly arriving call will be blocked and subsequently lost. The formula gives the probability of this occurring. In contrast, the Erlang C formula provides for the possibility of an unlimited queue and it gives the probability that a new call will need to wait in the queue due to all servers being in use. Erlang's formulae apply quite widely, but they may fail when congestion is especially high causing unsuccessful traffic to repeatedly retry. One way of accounting for retries when no queue is available is the Extended Erlang B method.

---

Traffic measurements of a telephone circuit When used to represent carried traffic, a value (which can be a non-integer such as 43.5) followed by "erlangs" represents the average number of concurrent calls carried by the circuits (or other service-providing elements), where that average is calculated over some reasonable period of time. The period over which the average is calculated is often one hour, but shorter periods (e.g., 15 minutes) may be used where it is known that there are short spurts of demand and a traffic measurement is desired that does not mask these spurts. One erlang of carried traffic refers to a single resource being in continuous use, or two channels each being in use fifty percent of the time, and so on. For example, if an office has two telephone operators who are both busy all the time, that would represent two erlangs (2 E) of traffic; or a radio channel that is occupied continuously during the period of interest (e.g. one hour) is said to have a load of 1 erlang.

When used to describe offered traffic, a value followed by "erlangs" represents the average number of concurrent calls that would have been carried if there were an unlimited number of circuits (that is, if the call-attempts that were made when all circuits were in use had not been rejected). The relationship between offered traffic and carried traffic depends on the design of the system and user behavior. Three common models are (a) callers whose call-attempts are rejected go away and never come back, (b) callers whose call-attempts are rejected try again within a fairly short space of time, and (c) the system allows users to wait in queue until a circuit becomes available.

A third measurement of traffic is instantaneous traffic, expressed as a certain number of erlangs, meaning the exact number of calls taking place at a point in time. In this case, the number is a non-negative integer. Traffic-level-recording devices, such as moving-pen recorders, plot instantaneous traffic.

---

Erlang's analysis The concepts and mathematics introduced by Agner Krarup Erlang have broad applicability beyond telephony. They apply wherever users arrive more or less at random to receive exclusive service from any one of a group of service-providing elements without prior reservation, for example, where the service-providing elements are ticket-sales windows, toilets on an airplane, or motel rooms. (Erlang's models do not apply where the service-providing elements are shared between several concurrent users or different amounts of service are consumed by different users, for instance, on circuits carrying data traffic.)

The goal of Erlang's traffic theory is to determine exactly how many service-providing elements should be provided in order to satisfy users, without wasteful over-provisioning. To do this, a target is set for the grade of service (GoS) or quality of service (QoS). For example, in a system where there is no queuing, the GoS may be that no more than 1 call in 100 is blocked (i.e., rejected) due to all circuits being in use (a GoS of 0.01), which becomes the target probability of call blocking, P_b, when using the Erlang B formula.

There are several resulting formulae, including Erlang B, Erlang C and the related Engset formula, based on different models of user behavior and system operation. These may each be derived by means of a special case of continuous-time Markov processes known as a birth–death process. The more recent Extended Erlang B method provides a further traffic solution that draws on Erlang's results.

---

Calculating offered traffic Offered traffic (in erlangs) is related to the call arrival rate, λ, and the average call-holding time (the average time of a phone call), h, by:

$E\; =\; \backslash lambda\; h$

provided that h and λ are expressed using the same units of time (seconds and calls per second, or minutes and calls per minute).

The practical measurement of traffic is typically based on continuous observations over several days or weeks, during which the instantaneous traffic is recorded at regular, short intervals (such as every few seconds). These measurements are then used to calculate a single result, most commonly the busy-hour traffic (in erlangs). This is the average number of concurrent calls during a given one-hour period of the day, where that period is selected to give the highest result. (This result is called the time-consistent busy-hour traffic). An alternative is to calculate a busy-hour traffic value separately for each day (which may correspond to slightly different times each day) and take the average of these values. This generally gives a slightly higher value than the time-consistent busy-hour value.

Where the existing busy-hour carried traffic, E_c, is measured on an already overloaded system, with a significant level of blocking, it is necessary to take account of the blocked calls in estimating the busy-hour offered traffic E_o (which is the traffic value to be used in the Erlang formulae). The offered traffic can be estimated by . For this purpose, where the system includes a means of counting blocked calls and successful calls, P_b can be estimated directly from the proportion of calls that are blocked. Failing that, P_b can be estimated by using E_c in place of E_o in the Erlang formula and the resulting estimate of P_b can then be used in to provide a first estimate of E_o.

Another method of estimating E_o in an overloaded system is to measure the busy-hour call arrival rate, λ (counting successful calls and blocked calls), and the average call-holding time (for successful calls), h, and then estimate E_o using the formula .

For a situation where the traffic to be handled is completely new traffic, the only choice is to try to model expected user behavior. For example, one could estimate active user population, N, expected level of use, U (number of calls/transactions per user per day), busy-hour concentration factor, C (proportion of daily activity that will fall in the busy hour), and average holding time/service time, h (expressed in minutes). A projection of busy-hour offered traffic would then be . (The division by 60 translates the busy-hour call/transaction arrival rate into a per-minute value, to match the units in which h is expressed.)

---

Erlang B formula The Erlang B formula (or Erlang-B with a hyphen), also known as the Erlang loss formula, is a formula for the blocking probability that describes the probability of call losses for a group of identical parallel resources (telephone lines, circuits, traffic channels, or equivalent), sometimes referred to as an M/M/c/c queue.

(1978). 9780120510504, Academic Press. ISBN 9780120510504

It is, for example, used to dimension a telephone network's links. The formula was derived by Agner Krarup Erlang and is not limited to telephone networks, since it describes a probability in a queuing system (albeit a special case with a number of servers but no queueing space for incoming calls to wait for a free server). Hence, the formula is also used in certain inventory systems with lost sales.

The formula applies under the condition that an unsuccessful call, because the line is busy, is not queued or retried, but instead really vanishes forever. It is assumed that call attempts arrive following a Poisson process, so call arrival instants are independent. Further, it is assumed that the message lengths (holding times) are exponentially distributed (Markovian system), although the formula turns out to apply under general holding time distributions.

The Erlang B formula assumes an infinite population of sources (such as telephone subscribers), which jointly offer traffic to N servers (such as telephone lines). The rate expressing the frequency at which new calls arrive, λ, (birth rate, traffic intensity, etc.) is constant, and does not depend on the number of active sources. The total number of sources is assumed to be infinite. The Erlang B formula calculates the blocking probability of a buffer-less loss system, where a request that is not served immediately is aborted, causing that no requests become queued. Blocking occurs when a new request arrives at a time where all available servers are currently busy. The formula also assumes that blocked traffic is cleared and does not return.

The formula provides the GoS (grade of service) which is the probability P_b that a new call arriving to the resources group is rejected because all resources (servers, lines, circuits) are busy: where E is the total offered traffic in erlang, offered to m identical parallel resources (servers, communication channels, traffic lanes).

$P\_\backslash text\{b\}\; =\; B(E,m)\; =\; \backslash frac\{\backslash frac\{E^m\}\{m!\}\}\; \{\; \backslash sum\_\{i=0\}^m\; \backslash frac\{E^i\}\{i!\}\}$

where:

• P_b is the probability of blocking
• m is the number of identical parallel resources such as servers, telephone lines, etc.
• E = λh is the normalised ingress load (offered traffic stated in erlang).

The erlang is a dimensionless load unit calculated as the mean arrival rate, λ, multiplied by the mean call holding time, h. The unit has to be dimensionless for Little's Law to be dimensionally sane.

This may be expressed recursively as follows, in a form that is used to simplify the calculation of tables of the Erlang B formula:

$B(E,0)\; =\; 1.\; \backslash ,$

$B(E,j)\; =\; \backslash frac\{E\; B(E,j\; -\; 1)\}\{E\; B(E,j\; -\; 1)\; +\; j\}\; \backslash \; \backslash forall\{j\}\; =\; 1,2,\backslash ldots,m.$

Typically, instead of B( E, m) the inverse 1/ B( E, m) is calculated in numerical computation in order to ensure numerical stability:

$\backslash frac\{1\}\{B(E,0)\}\; =\; 1$

$\backslash frac\{1\}\{B(E,j)\}\; =\; 1\; +\; \backslash frac\{j\}\{E\}\backslash frac\{1\}\{B(E,j\; -\; 1)\}\; \backslash \; \backslash forall\{j\}\; =\; 1,2,\backslash ldots,m.$

The recursive form is derivable from the non-recursive form by repeated substitution.

Function ErlangB (E As Double, m As Integer) As Double

   Dim InvB As Double
   Dim j As Integer
     

   InvB = 1.0
   For j = 1 To m
       InvB = 1.0 + InvB * j / E
   Next j
   ErlangB = 1.0 / InvB
     

End Function

or a Python version:

def erlang_b(E: float, m: int) -> float:

   """Calculate the probability of call losses."""
   inv_b = 1.0
   for j in range(1, m + 1):
       inv_b = 1.0 + inv_b * j / E
   return 1.0 / inv_b
     

The Erlang B formula is decreasing and convex function in m.Messerli, E.J., 1972. 'Proof of a convexity property of the Erlang B formula'. Bell System Technical Journal 51, 951–953. It requires that call arrivals can be modeled by a Poisson process, which is not always a good match, but is valid for any statistical distribution of call holding times with a finite mean. It applies to traffic transmission systems that do not buffer traffic. More modern examples compared to POTS where Erlang B is still applicable, are optical burst switching (OBS) and several current approaches to optical packet switching (OPS). Erlang B was developed as a trunk sizing tool for telephone networks with holding times in the minutes range, but being a mathematical equation it applies on any time-scale.

---

Extended Erlang B Extended Erlang B differs from the classic Erlang-B assumptions by allowing for a proportion of blocked callers to try again, causing an increase in offered traffic from the initial baseline level. It is an iteration rather than a formula and adds an extra parameter, the recall factor $R\_\backslash text\{f\}$, which defines the recall attempts.'Designing optimal voice networks for businesses, government, and telephone companies' by J. Jewett, J. Shrago, B. Yomtov, TelCo Research, Chicago, 1980.

The steps in the process are as follows.Inayatullah, M., Ullah, F.K., Khan., A.N., 'An Automated Grade Of Service Measuring System', IEEE—ICET 2006, 2nd International Conference on Emerging Technologies, Peshawar, Pakistan 13–14 November 2006, pp. 230–237 It starts at iteration $k=0$ with a known initial baseline level of traffic $E\_\{0\}$, which is successively adjusted to calculate a sequence of new offered traffic values $E\_\{k+1\}$, each of which accounts for the recalls arising from the previously calculated offered traffic $E\_\{k\}$.

1. Calculate the probability of a caller being blocked on their first attempt $$P\_\backslash text\{b\}\; =\; B(E\_k,m)$$ as above for Erlang B.
2. Calculate the probable number of blocked calls $$B\_\backslash text\{e\}\; =\; E\_k\; P\_\backslash text\{b\}$$
3. Calculate the number of recalls, $R$, assuming a fixed recall factor, $R\_\backslash text\{f\}$, $$R\; =\; B\_\backslash text\{e\}\; R\_\backslash text\{f\}$$
4. Calculate the new offered traffic $$E\_\{k+1\}=E\_\{0\}+R$$ where $E\_\{0\}$ is the initial (baseline) level of traffic.
5. Return to step 1, substituting $E\_\{k+1\}$ for $E\_\{k\}$, and iterate until a stable value of $E$ is obtained.

Once a satisfactory value of $E$ has been found, the blocking probability $P\_\backslash text\{b\}$ and the recall factor can be used to calculate the probability that all of a caller's attempts are lost, not just their first call but also any subsequent retries.

---

Erlang C formula The Erlang C formula expresses the probability that an arriving customer will need to queue (as opposed to immediately being served).

(1975). 9780471491101 ISBN 9780471491101

Just as the Erlang B formula, Erlang C assumes an infinite population of sources, which jointly offer traffic of $E$ erlangs to $m$ servers. However, if all the servers are busy when a request arrives from a source, the request is queued. An unlimited number of requests may be held in the queue in this way simultaneously. This formula calculates the probability of queuing offered traffic, assuming that blocked calls stay in the system until they can be handled. This formula is used to determine the number of agents or customer service representatives needed to staff a call centre, for a specified desired probability of queuing. However, the Erlang C formula assumes that callers never hang up while in queue, which makes the formula predict that more agents should be used than are really needed to maintain a desired service level.

$P\_\backslash text\{w\}\; =\; \backslash over\; \backslash left\; (\; \backslash sum\backslash limits\_\{i=0\}^\{m-1\}\; \backslash frac\{E^i\}\{i!\}\; \backslash right\; )\; +\; \backslash frac\{E^m\}\{m!\}\; \backslash frac\{m\}\{m\; -\; E\}\}$

where:

• $E$ is the total traffic offered in units of erlangs
• $m$ is the number of servers
• $P\_\backslash text\{w\}$ is the probability that a customer has to wait for service.

It is assumed that the call arrivals can be modeled by a Poisson process and that call holding times are described by an exponential distribution, therefore the Erlang C formula follows from the assumptions of the M/M/c queue model.

---

Limitations of the Erlang formula When Erlang developed the Erlang-B and Erlang-C traffic equations, they were developed on a set of assumptions. These assumptions are accurate under most conditions; however in the event of extremely high traffic congestion, Erlang's equations fail to accurately predict the correct number of circuits required because of re-entrant traffic. This is termed a high-loss system, where congestion breeds further congestion at peak times. In such cases, it is first necessary for many additional circuits to be made available so that the high loss can be alleviated. Once this action has been taken, congestion will return to reasonable levels and Erlang's equations can then be used to determine how exactly many circuits are really required.

An example of an instance which would cause such a High Loss System to develop would be if a TV-based advertisement were to announce a particular telephone number to call at a specific time. In this case, a large number of people would simultaneously phone the number provided. If the service provider had not catered for this sudden peak demand, extreme traffic congestion will develop and Erlang's equations cannot be used.

---

See also

---

Further reading

Post Comment